Quadtrees, Mandelbrot percolation and the modelling of random sets
نویسنده
چکیده
A selection of these reports is available in PostScript form at the Faculty's anonymous ftp-Abstract Any binary image can be represented by a quadtree. Therefore random quadtrees correspond to bounded random sets in the plane. We discuss various possibilities for randomizing the quadtree. The most natural randomization yields Mandelbrot percolation.
منابع مشابه
On the size of the algebraic difference of two random Cantor sets
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one implies the existence of interior points in the difference set of two independent copies. We prove that this is the case for the so called Mandelbrot percolation. On the other hand the same is not always true if we ap...
متن کاملRandom Fractals and Tree - Indexed Markov
We study the size properties of a general model of fractal sets that are based on a tree-indexed family of random compacts and a tree-indexed Markov chain. These fractals may be regarded as a generalization of those resulting from the Moran-like deterministic or random recursive constructions considered by various authors. Among other applications, we consider various extensions of Mandelbrot's...
متن کاملGeneration of 3D Fractal Images for Mandelbrot and Julia Sets
Fractals provide an innovative method for generating 3D images of real-world objects by using computational modelling algorithms based on the imperatives of self-similarity, scale invariance, and dimensionality. Images such as coastlines, terrains, cloud mountains, and most interestingly, random shapes composed of curves, sets of curves, etc. present a multivaried spectrum of fractals usage in ...
متن کاملThe Computational Complexity of Generating Random Fractals
In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation. Di usion limited aggregation and several widely used algorithms for equilibrating the Ising model are shown to be highly sequential; it is unlikely they can be simulated e ciently in parallel. This is i...
متن کاملUniversal Behavior of Connectivity Properties in Fractal Percolation Models
Partially motivated by the desire to better understand the connectivity phase transition in fractal percolation, we introduce and study a class of continuum fractal percolation models in dimension d ≥ 2. These include a scale invariant version of the classical (Poisson) Boolean model of stochastic geometry and (for d = 2) the Brownian loop soup introduced by Lawler and Werner. The models lead t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995